Privacy by Projection: Federated Population Density Estimation by Projecting on Random Features
نویسندگان
چکیده
We consider the problem of population density estimation based on location data crowdsourced from mobile devices, using kernel (KDE). In a conventional, centralized setting, KDE requires users to upload their server, thus raising privacy concerns. Here, we propose Federated framework for estimating user density, which not only keeps devices but also provides probabilistic guarantees against malicious server that tries infer users' location. Our approach random Fourier feature (RFF) leverages representation solution, in each user's information is irreversibly projected onto small number spatially delocalized basis functions, making precise localization impossible while still allowing estimation. evaluate our method both synthetic and real-world datasets, show it achieves better utility (estimation performance)-vs-privacy (distance between inferred true locations) tradeoff, compared state-of-the-art baselines (e.g., GeoInd). vary functions per user, further improve privacy-utility trade-off, provide analytical bounds as function areal unit size bandwidth.
منابع مشابه
Random Projection RBF Nets for Multidimensional Density Estimation
The dimensionality and the amount of data that need to be processed when intensive data streams are observed grow rapidly together with the development of sensors arrays, CCD and CMOS cameras and other devices. The aim of this paper is to propose an approach to dimensionality reduction as a first stage of training RBF nets. As a vehicle for presenting the ideas, the problem of estimating multiv...
متن کاملProjection Pursuit Density Estimation
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملRandom Projection Features and Generalized Additive Models
We propose to learn generalized additive models for classification which represents the classifier using a sum of piecewise linear functions and show that a recently proposed fast linear SVM training method (Pegasos) can be adapted to train such models with the same convergence rates. To be able to learn functions on combination of dimensions, we explore the use of random projection features wh...
متن کاملRetrieval for Text Streams by Random Projection
In powerful yet efficient retrieval for text stream, one of the problems is how to maintain incremental information. In this investigation, we show that retrieval method using random projection is nearly useful choice for dynamic dimensionality reduction. We examine some experiments and show efficiency for computation and memory reducing dimension to incremental documents.
متن کاملRandom Projection-Based Anderson-Darling Test for Random Fields
In this paper, we present the Anderson-Darling (AD) and Kolmogorov-Smirnov (KS) goodness of fit statistics for stationary and non-stationary random fields. Namely, we adopt an easy-to-apply method based on a random projection of a Hilbert-valued random field onto the real line R, and then, applying the well-known AD and KS goodness of fit tests. We conclude this paper by studying the behavior o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings on Privacy Enhancing Technologies
سال: 2023
ISSN: ['2299-0984']
DOI: https://doi.org/10.56553/popets-2023-0019